The Minkowski problem for polytopes

نویسندگان

  • Daniel A. Klain
  • Erwin Lutwak
چکیده

The traditional solution to the Minkowski problem for polytopes involves two steps. First, the existence of a polytope satisfying given boundary data is demonstrated. In the second step, the uniqueness of that polytope (up to translation) is then shown to follow from the equality conditions of Minkowski’s inequality, a generalized isoperimetric inequality for mixed volumes that is typically proved in a separate context. In this article we adapt the classical argument to prove both the existence theorem of Minkowski and his mixed volume inequality simultaneously, thereby providing a new proof of Minkowski’s inequality that demonstrates the equiprimordial relationship between these two fundamental theorems of convex geometry. r 2003 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Orlicz Minkowski Problem for Polytopes

Quite recently, an Orlicz Minkowski problem has been posed and the existence part of this problem for even measures has been presented. In this paper, the existence part of the Orlicz Minkowski problem for polytopes is demonstrated. Furthermore, we obtain a solution of the Orlicz Minkowski problem for general (not necessarily even) measures.

متن کامل

Relative Stanley–reisner Theory and Lower Bound Theorems for Minkowski Sums

This note complements an earlier paper of the author by providing a lower bound theorem for Minkowski sums of polytopes. In [AS16], we showed an analogue of McMullen’s Upper Bound theorem for Minkowski sums of polytopes, estimating the maximal complexity of such a sum of polytopes. A common question in reaction to that research was the question for an analogue for the Barnette’s Lower Bound The...

متن کامل

Computing All Faces of the Minkowski Sum of V-Polytopes

We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R. An algorithm for listing all faces of dimension up to j is presented, for any given 0 ≤ j ≤ d − 1. It runs in time polynomial in the sizes of input and output.

متن کامل

Computing faces up to k dimensions of a Minkowski Sum of Polytopes

We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R. An algorithm for listing all faces of dimension up to j is presented, for any given 0 ≤ j ≤ d − 1. It runs in time polynomial in the sizes of input and output.

متن کامل

Minkowski Sum of Polytopes and Its Normality

In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex polytopes. We also study Minkowski sums of edge polytopes and give a sufficient condition for Minkowski sums of edge polytopes to have IDP.

متن کامل

THE L p MINKOWSKI PROBLEM FOR POLYTOPES FOR p < 0

Existence of solutions to the Lp Minkowski problem is proved for all p < 0. For the critical case of p = −n, which is known as the centro-affine Minkowski problem, this paper contains the main result in [71] as a special case.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004